Generic Tableaux for Answer Set Programming
نویسندگان
چکیده
We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs. To this end, we generalize previous work characterizing computations in ASP by means of tableau methods. We start with a very basic core fragment in which rule heads and bodies consist of atomic literals. We then gradually extend this setting by focusing on the concept of an aggregate, understood as an operation on a collection of entities. We exemplify our framework by applying it to conjunctions in rule bodies, cardinality constraints as used in smodels, and finally to disjunctions in rule heads.
منابع مشابه
Abduction in equilibrium logic
Equilibrium logic is a system of nonmonotonic reasoning that generalises answer set semantics for logic program~ to a syntactically broader class of theories. The paper discusses the problem of abduction for equilibrium logic, making use of tableaux systems for equilibrium entailment presented in (Pearce, de Guzm(m, Valverde 2000b). An algorithm for generating potential abductive explanations i...
متن کاملExtended ASP Tableaux and Rule Redundancy in Normal Logic Programs
We introduce an extended tableau calculus for answer set programming (ASP). The proof system is based on the ASP tableaux defined in [Gebser&Schaub, ICLP 2006], with an added extension rule. We investigate the power of Extended ASP Tableaux both theoretically and empirically. We study the relationship of Extended ASP Tableaux with the Extended Resolution proof system defined by Tseitin for clau...
متن کاملChecking Strong Equivalence with Duplication-Free Tableaux
In Answer Set Programming, Lifschitz, Pearce and Valverde have defined Strong equivalence as follows: Π1 and Π2 are strongly equivalent if for every program Π, Π1 ∪ Π and Π2 ∪ Π are equivalent, i.e., have the same answer sets. A logical characterization of Strong Equivalence is provided by the same authors via i) translation of programs into a classical signature (creating, say, c(Π1) and c(Π2)...
متن کاملTableaux Calculi for Answer Set Programming
We introduce a family of calculi for Answer Set Programming (ASP) based on tableaux methods. Our approach furnishes declarative and fine-grained instrumentalities for characterizing operations as well as strategies of ASP-solvers. First, the granulation is detailed enough to capture the variety of propagation and choice operations in algorithms used for ASP; this also includes SAT-based approac...
متن کاملSynthesis from Temporal Specifications Using Preferred Answer Set Programming
We use extended answer set programming (ASP), a logic programming paradigm which allows for the defeat of conflicting rules, to check satisfiability of computation tree logic (CTL) temporal formulas via an intuitive translation. This translation, to the best of our knowledge the first of its kind for CTL, allows CTL reasoning with existing answer set solvers. Furthermore, we demonstrate how pre...
متن کامل